Concurrency theory: timed automata, testing, program synthesis

Concurrency in Timed Automata

Testing timed automata

We present a generalization of the classical theory of testing for Mealy machines to a setting of dense real-time systems. A model of timed I/O automata is introduced, inspired by the timed automaton model of Alur and Dill, together with a notion of test sequence for this model. Our main contribution is a test suite derivation algorithm for black-box conformance testing of timed I/O automata. I...

Code Synthesis for Timed Automata

We present a framework for development of real-time embedded systems based on the recently presented model of timed automata extended with real-time tasks. It has been shown previously that design problems such as reachability and schedulability are decidable for the model of timed automata with tasks. In this paper we describe how to automatically synthesise executable code with predictable ti...

Controller Synthesis for Timed Automata

In this work we tackle the following problem given a timed automaton restrict its transition relation in a systematic way so that all the remaining behaviors satisfy certain properties This is an extension of the problem of controller synthesis for discrete event dynamical systems where in addition to choosing among actions the controller have the option of doing nothing and let the time pass T...

A Theory of Timed Automata

Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e) automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words-infinite sequenc...